Monotone and 1–1 sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positive sets and monotone sets

In this paper, we show how convex analysis can be applied to the theory of sets that are “positive” with respect to a continuous quadratic form on a Banach space. Monotone sets can be considered as a special case of positive sets, and we show how our results lead to very efficient proofs of a number of results on monotone sets. One of the key techniques that we use is a generalization of the Fi...

متن کامل

Semi - Monotone Sets

A coordinate cone in R n is an intersection of some coordinate hy-perplanes and open coordinate half-spaces. A semi-monotone set is an open bounded subset of R n , definable in an o-minimal structure over the reals, such that its intersection with any translation of any coordinate cone is connected. This can be viewed as a generalization of the convexity property. Semi-monotone sets have a numb...

متن کامل

Baire Category for Monotone Sets

We study Baire category for downward-closed subsets of 2ω , showing that it behaves better in this context than for general subsets of 2ω . We show that, in the downward-closed context, the ideal of meager sets is prime and b-complete, while the complementary filter is g-complete. We also discuss other cardinal characteristics of this ideal and this filter, and we show that analogous results fo...

متن کامل

Cardinal invariants of monotone and porous sets

A metric space (X, d) is monotone if there is a linear order < on X and a constant c such that d(x, y) 6 c d(x, z) for all x < y < z in X. We investigate cardinal invariants of the σ-ideal Mon generated by monotone subsets of the plane. Since there is a strong connection between monotone sets in the plane and porous subsets of the line, plane and the Cantor set, cardinal invariants of these ide...

متن کامل

Fast Monotone Summation over Disjoint Sets

We study the problem of computing an ensemble of multiple sums where the summands in each sum are indexed by subsets of size p of an n-element ground set. More precisely, the task is to compute, for each subset of size q of the ground set, the sum over the values of all subsets of size p that are disjoint from the subset of size q. We present an arithmetic circuit that, without subtraction, sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1982

ISSN: 0263-6115

DOI: 10.1017/s1446788700017626